Definite-clause set grammars: a formalism for problem solving
نویسندگان
چکیده
منابع مشابه
Definite-Clause Set Grammars: A Formalism for Problem Solving
D First, we present definite-clause set grammars (DCSG), a DCG-like formalism for free-word-order languages. The DCSG formalism is well suited for problem solving. By dealing with DCSG as a generalized parsing problem, we avoid a certain type of looping problem in backward chaining. Next, we extend DCSG by viewing grammar rules as definitions for set conversions. In order to realize inverse con...
متن کاملStochastic Definite Clause Grammars
This paper introduces Stochastic Definite Clause Grammars, a stochastic variant of the wellknown Definite Clause Grammars. The grammar formalism supports parameter learning from annotated or unannotated corpora and provides a mechanism for parse selection by means of statistical inference. Unlike probabilistic contextfree grammars, it is a context-sensitive grammar formalism and it has the abil...
متن کاملExtending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs in Horn clauses. Some linguistic phenomena, such as filler-gap dependencies, are difficult to account for in a completely satisfactory way using simple phrase structured grammar. In the literature of logic grammars ther...
متن کاملA Generalized Greibach Normal Form for Definite Clause Grammars
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for context-free grammars. The normalized definite clause grammar is declaratively equivalent to the original definite clause grammar, that is, it assigns the same analyses to the same strings. Offline-parsability of the ...
متن کاملDefinite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks
A clear andpowerfulformalism for describing languages, both natural and artificial, follows f iom a method for expressing grammars in logic due to Colmerauer and Kowalski. This formalism, which is a natural extension o f context-free grammars, we call "definite clause grammars" (DCGs). A DCG provides not only a description of a language, but also an effective means for analysing strings o f tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1991
ISSN: 0743-1066
DOI: 10.1016/0743-1066(91)90002-7